Branch Merge Reduction of RLCM Networks
نویسنده
چکیده
In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted at parasitic extractors for verification of VLSI designs, the proposed algorithm uses a branch merge, node elimination methodology, with the choice of nodes for elimination being guided by time-constant criteria. Reliable, accurate, easy to code, the algorithm works well for coupled buses and clocks, strongly inductive networks, and low-loss transmission lines, as well as for lossy RLC networks.
منابع مشابه
On Some Separability, Reducibility and Controllability Criteria of RLCM Networks over F(Z)
The separability of a resistor-inductorcapacitor-mutual inductance (RLCM) network is defined in this paper. Some separability, reducibility and controllability (observability) criteria of RLCM networks over ( ) F z are derived. Two illustrative examples are given. Index Term—RLCM Networks, Separability, Reducibility, Controllability
متن کاملExtending Recurrence Local Computation Approach Towards Ordering Composite Beliefs in Multiply Connected Bayesian Belief Networks
The Recurrence Local Computation Method (RLCM) for nding the most probable explanations (MPE) in a Bayesian belief network is valuable in assisting human beings to explain the possible causes of a set of evidences. However, RLCM works only on singly connected belief networks. This paper presents an extension of the RLCM which can be applied to multiply connected belief networks for nding arbitr...
متن کاملMaxi-Min discriminant analysis via online learning
Linear Discriminant Analysis (LDA) is an important dimensionality reduction algorithm, but its performance is usually limited on multi-class data. Such limitation is incurred by the fact that LDA actually maximizes the average divergence among classes, whereby similar classes with smaller divergence tend to be merged in the subspace. To address this problem, we propose a novel dimensionality re...
متن کاملCompiler-Assisted Dynamic Predicated Execution of Complex Control-Flow Structures
Even after decades of research in branch prediction, branch predictors still remain imperfect, which results in significant performance loss in aggressive processors that support large instruction windows and deep pipelines. This paper proposes a new processor architecture for handling hard-to-predict branches, the diverge-merge processor. The goal of this paradigm is to eliminate branch mispre...
متن کاملDTMP: Energy Consumption Reduction in Body Area Networks Using a Dynamic Traffic Management Protocol
Advances in medical sciences with other fields of science and technology is closely casual profound mutations in different branches of science and methods for providing medical services affect the lives of its descriptor. Wireless Body Area Network (WBAN) represents such a leap. Those networks excite new branches in the world of telemedicine. Small wireless sensors, to be quite precise and calc...
متن کامل